Realization of Prime-Length Discrete Sine Transform Using Cyclic Convolution
نویسنده
چکیده
This paper presents a new algorithm for the implementation of an N-point prime-length discrete sine transform (DST) through cyclic convolution. The proposed algorithm is based on the idea of reformulating prime N-length DST into two 1 /2 point cyclic convolutions. Thus, the hardware complexity can be reduced. This cyclic convolution –based algorithm is used to obtain a simple systolic array for pipelined implementation of the DST. This algorithm preserves all the benefits of very large-scale integration algorithms based on cyclic convolution or circular convolution, such as regular and simple structure. The convolutions play a significant role in digital signal processing due to their nature of easy implementation.
منابع مشابه
An Efficient Parallel Adder Based Design for One Dimensional Discrete Fourier Transform
This paper presents a new efficient parallel adder (PA) based design for the one-dimensional (1-D) anylength discrete Fourier transform (DFT). Using the Chirp-Z transform, the author develops an algorithm which can formulate the 1-D any-length DFT as cyclic convolutions. This algorithm exhibits higher flexibility in the transform length as compared with the existing approaches to prime length D...
متن کاملAn efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). In this paper, we present a new prime-factor algorithm for the DCT. We also design a prime-factor algorithm for the discrete sine transform which...
متن کاملRecursive Algorithms for Realization of One- Dimensional Discrete Sine Transform and Inverse Discrete Sine Transform
In this paper, novel recursive algorithms for realization of one-dimensional discrete sine transform (DST) and inverse discrete sine transform (IDST) of any length are proposed. By using some mathematical techniques, recursive expressions for DST and IDST have been developed. Then, the DST and IDST are implemented by recursive filter structures. A linear systolic architecture for realization of...
متن کاملBilinear algorithms for discrete cosine transforms of prime lengths
Abstract: This paper presents a strategy to design bilinear discrete cosine transform (DCT) algorithms of prime lengths. We show that by using multiplicative groups of integers, one can identify and arrange the computation as a pair of convolutions. When the DCT length p is such that (p−1)/2 is odd, the computation uses two (p−1)/2 point cyclic convolutions. When (p − 1)/2 = 2q with m > 0 and q...
متن کاملA systolic array architecture for the discrete sine transform
An efficient approach to design very large scale integration (VLSI) architectures and a scheme for the implementation of the discrete sine transform (DST), based on an appropriate decomposition method that uses circular correlations, is presented. The proposed design uses an efficient restructuring of the computation of the DST into two circular correlations, having similar structures and only ...
متن کامل